Slender 0L languages

A Note on Slender 0l Languages

We give a complete proof of Theorem 3.1 in [2]. A pathological exception of Theorem 4.3 in [2] is exhibited and a condition to remove it is mentioned. TUCS Research Group Mathematical Structures of Computer Science

On 0L-Languages

On Parikh slender context-free languages

In a recent paper we de ned and studied Parikh slender languages and showed that they can be used in simplifying ambiguity proofs of context-free languages. In this paper Parikh slender context-free languages are characterized. The characterization has diverse applications. TUCS Research Group Mathematical Structures of Computer Science

A characterization of poly-slender context-free languages

For a non-negative integer k, we say that a language L is k-poly-slender if the number of words of length n in L is of order O(n k). We give a precise characterization of the k-poly-slender context-free languages. The well-known characterization of the k-poly-slender regular languages is an immediate consequence of ours.

Recognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata

A linear-slender context-free language is a context-free language whose number of words of length n is linear in n. Its structure has been finely characterized in a work of Ilie, Rozenberg and Salomaa. Thanks to this characterization, we show that every linear-slender context-free language is recognizable by a real time one-way cellular automaton.